On-Line Real-Time Service-Oriented Task Scheduling Using TUF
نویسندگان
چکیده
منابع مشابه
On-Line Real-Time Service-Oriented Task Scheduling Using TUF
We present our approach to real-time service-oriented scheduling problems with the objective of maximizing the total system utility. Different from the traditional utility accrual scheduling problems that each task is associated with only a single time utility function (TUF), we associate two different TUFs—a profit TUF and a penalty TUF—with each task, tomodel the real-time services that not o...
متن کاملOn-line real-time task scheduling on partitionable multiprocessors
Multiprocesssor systems have emerged as an important computing means for real-time applications and have received increasing attention than before. However , until now, little research has been done on the problem of on-line scheduling of parallel tasks with deadlines in partitionable multiprocessor systems. In this paper, we propose a new on-line scheduling algorithm , called Deferred Earliest...
متن کاملReal-Time Scheduling Using Compact Task Graphs
The generation of a real-time schedule from a task precedence graph is complex and time consuming. In order to improve the eeciency of generating schedules, we propose a scheduling algorithm based upon the compact task graph (CTG) representation. In addition to precedence constraints, a CTG explicitly expresses the potential for interleaving the execution of tasks on a single processor and over...
متن کاملDynamic Real - Time Task Scheduling
Multiprocesssor systems have emerged as an important computing means for real-time applications and have received increasing attention than before. However, until now, little research has been done on the problem of on-line scheduling of parallel tasks with deadlines in partitionable multiprocessor systems. Meshes and hypercubes belong to this class of multiprocessors. In this paper, we propose...
متن کاملOn-line service scheduling
This paper is concerned with a scheduling problem that occurs in service systems, where customers are classified as ‘ordinary’ and ‘special’. Ordinary customers can be served on any service facility, while special customers can be served only on the flexible service facilities. Customers arrive dynamically over time and their needs become known upon arrival. We assume any service, once started,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ISRN Software Engineering
سال: 2012
ISSN: 2090-7680
DOI: 10.5402/2012/681985